ranking efficient dmus using the infinity norm and virtual inefficient dmu in dea
نویسندگان
چکیده
in many applications, ranking of decision making units (dmus) is a problematic technical task procedure to decision makers in data envelopment analysis (dea), especially when there are extremely efficient dmus. in such cases, many dea models may usually get the same efficiency score for different dmus. hence, there is a growing interest in ranking techniques yet. the purpose of this paper is ranking extreme efficient dmus in dea based on exploiting the leave-one out and minimizing the maximum distance between dmu under evaluation and boundary efficient in input and output directions. the proposed method has been able to overcome the lacks of infeasibility and unboundedness in some dea ranking methods.
منابع مشابه
Ranking efficient DMUs using the infinity norm and virtual inefficient DMU in DEA
In many applications, ranking of decision making units (DMUs) is a problematic technical task procedure to decision makers in data envelopment analysis (DEA), especially when there are extremely efficient DMUs. In such cases, many DEA models may usually get the same efficiency score for different DMUs. Hence, there is a growing interest in ranking techniques yet. The purpose of this paper is ra...
متن کاملRanking Efficient DMUs Using the Infinity Norm and Virtual Inefficient DMU in DEA
1 Department of Computer, Firoozkooh branch, Islamic Azad University, Firoozkooh, Iran 2 Department of Mathematics, Firoozkooh branch, Islamic Azad University, Firoozkooh, Iran Manaf Sharifzadeh1 and Shokrollah Ziari 2* Iranian Journal of Optimization Volume 8, Issue 2, 2016, 79-86 Research Paper Islamic Azad University Rasht Branch E-ISSN:2008-5427 Online version is available on: www.ijo.iaura...
متن کاملRanking efficient DMUs using minimizing distance in DEA
In many applications, ranking of decision making units (DMUs) is a problematic technical task procedure to decision makers in data envelopment analysis (DEA), especially when there are extremely efficient DMUs. In such cases, many DEA models may usually get the same efficiency score for different DMUs. Hence, there is a growing interest in ranking techniques yet. The main purpose of this paper ...
متن کاملRanking efficient DMUs using the variation coefficient of weights in DEA
One of the difficulties of Data Envelopment Analysis(DEA) is the problem of deciency discriminationamong efficient Decision Making Units(DMUs) and hence, yielding large number of DMUs as efficientones. The main purpose of this paper is to overcome this inability. One of the methods for rankingefficient DMUs is minimizing the Coefficient of Variation (CV) for inputs-outputs weights. In this pape...
متن کاملAn approach to rank efficient DMUs in DEA based on combining Manhattan and infinity norms
In many applications, discrimination among decision making units (DMUs) is a problematic technical task procedure to decision makers in data envelopment analysis (DEA). The DEA models unable to discriminate between extremely efficient DMUs. Hence, there is a growing interest in improving discrimination power in DEA yet. The aim of this paper is ranking extreme efficient DMUs in DEA based on exp...
متن کاملRanking Efficient DMUs Using the Variation Coefficient of Weights in DEA
One of the difficulties of Data Envelopment Analysis(DEA) is the problem of de_ciency discrimination among efficient Decision Making Units (DMUs) and hence, yielding large number of DMUs as efficient ones. The main purpose of this paper is to overcome this inability. One of the methods for ranking efficient DMUs is minimizing the Coefficient of Variation (CV) for inputs-outputs weights. In this...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
iranian journal of optimizationجلد ۸، شماره ۲، صفحات ۱۰۰۰-۱۰۱۲
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023